Wadge-like reducibilities on arbitrary quasi-Polish spaces
نویسندگان
چکیده
The structure of the Wadge degrees on zero-dimensional spaces is very simple (almost well-ordered), but for many other natural non-zerodimensional spaces (including the space of reals) this structure is much more complicated. We consider weaker notions of reducibility, including the so-called ∆ 0 α-reductions, and try to find for various natural topological spaces X the least ordinal αX such that for every αX ≤ β < ω1 the degree-structure induced on X by the ∆ β -reductions is simple (i.e. similar to the Wadge hierarchy on the Baire space). We show that αX ≤ ω for every quasi-Polish space X, that αX ≤ 3 for quasi-Polish spaces of dimension 6= ∞, and that this last bound is in fact optimal for many (quasi-)Polish spaces, including the real line and its
منابع مشابه
Lipschitz and uniformly continuous Reducibilities on Ultrametric polish spaces
We analyze the reducibilities induced by, respectively, uniformly continuous, Lipschitz, and nonexpansive functions on arbitrary ultrametric Polish spaces, and determine whether under suitable set-theoretical assumptions the induced degree-structures are well-behaved.
متن کاملAntichains in the Wadge Order for Connected Spaces
For any non-totally disconnected Polish space, there is a family of c = 2א0 many Wadge incomparable finite level Borel subsets. If the space is additionally locally compact or locally connected, there is a family of 2 many Wadge incomparable subsets. In this note, we study the Wadge order for Polish spaces which are not totally disconnected. For a fixed Polish space, the Wadge order for the spa...
متن کاملA Wadge hierarchy for second countable spaces
Wadge reducibility provides a rich and nice analysis of Borel sets in Polish zero dimensional spaces. However, outside this framework, reducibility by continuous functions was shown to be ill behaved in many important cases. We define a notion of reducibility for subsets of a second countable T0 topological space based on the notions of admissible representations and relatively continuous relat...
متن کاملWadge Reducibility and Infinite Computations
Introduction Investigation of the infinite behavior of computing devices is of great interest for computer science because many hardware and software concurrent systems (like processors or operating systems) may not terminate. The study of infinite computations is important for several branches of theoretical computer science, including verification and synthesis of reactive computing systems [...
متن کاملBorel-amenable reducibilities for sets of reals
We show that if F is any “well-behaved” subset of the Borel functions and we assume the Axiom of Determinacy then the hierarchy of degrees on P(ωω) induced by F turns out to look like the Wadge hierarchy (which is the special case where F is the set of continuous functions).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematical Structures in Computer Science
دوره 25 شماره
صفحات -
تاریخ انتشار 2015